Optimal one - to - many parallel routing algorithm in n - star networks 網(wǎng)絡中最優(yōu)的點到多點平行路由算法
Study on behavior impacts caused by travel information systems in parallel route network 平行路徑網(wǎng)絡中信息對交通行為的影響研究
For example , whether the fares offered by other public transport services of parallel routes are more attractive than the existing fares of the relevant bus service , and whether the introduction of section fares could enhance the competitiveness of the bus service 例如其他相類公共交通服務的收費水平是否比有關巴士服務的現(xiàn)有收費水平吸引,增設分段收費是否可以增加有關巴士服務的競爭力。
Thirdly , we study an efficient parallel routing table computation algorithm , we describe xipeng ' s parallel routing table computation algorithm with formal method , and improve the dividing algorithm of area . the automatic finding and maintenance can be completed in the division 對xipeng提出的并行路由表計算方法進行了形式化的描述,對其發(fā)現(xiàn)和維護warr算法進行了改進,實現(xiàn)了路由表計算過程中自動發(fā)現(xiàn)及維護warr的功能。
Based on the analysis and comparison on the normal design methods of distributing system , we propose a wholely distributed implementation method of ospf based on warr ( with - area - routing - region ) , lay an emphasis on the parallel routing table computation and the design of the link state database , and describe the ospf protocol processing in detail . in the chapter four we give a software implementation of our design . the test of implementation proves that our design is feasible and correct 在對現(xiàn)有分布式系統(tǒng)一般設計方法分析比較的基礎上,提出了基于warr ( witharearoutingregion )技術的全分布ospf協(xié)議實現(xiàn)方案,重點對并行路由表計算及鏈路狀態(tài)數(shù)據(jù)庫發(fā)計進行了詳細研究,并詳細分析了osfp協(xié)議的各個處理過程,從軟件設計角度實現(xiàn)了該設計方案,實際測試環(huán)境測試的結果驗證了該方案的可行性及正確性,同時系統(tǒng)性能分析的結果表明,該設計方案能滿足tbit路由器設計需求。